Reducing Hardware in LUT-Based Mealy FSMs with Encoded Collections of Outputs

نویسندگان

چکیده

A method is proposed that focused on reducing the chip area occupied by logic elements creating circuit of Mealy finite state machines (FSMs). The aimed at FSM circuits implemented with internal resources field-programmable gate arrays (FPGA). required estimated number look-up table (LUT) in a particular circuit. based mutual application two methods structural decomposition. first them dividing set outputs and using unitary-maximum encoding collections outputs. second states classes compatible states. optimization achieved replacing maximum binary codes two-part this article. Each code consists class including inside class. approach leads to three-level LUT-based circuits. level generates three types partial functions: unitary encoded outputs, variables input memory functions. function represented single LUT. LUTs from generate final values these third implement An example synthesis applying discussed. experiments were conducted standard benchmark FSMs. Their results showed significant improving an LUT count decreased average 9.49%. positive side effect was increasing value operating frequency (on average, 8.73%). advisable use if single-level implementation impossible.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reducing Hardware Complexity of Wallace Multiplier Using High Order Compressors Based on CNTFET

   Multiplier is one of the important components in many systems such as digital filters, digital processors and data encryption. Improving the speed and area of multipliers have impact on the performance of larger arithmetic circuits that are part of them. Wallace algorithm is one of the most famous architectures that uses a tree of half adders and full adders to increase the speed and red...

متن کامل

Synthesis of FSMs on the Basis of Reusable Hardware Templates

This paper suggests a reusable hardware template (HT) for finite state machines (FSM) and a method for the synthesis of FSMs based on such a template. The HT is a circuit with a predefined structure that has already been implemented in hardware (for example, in FPGA). By reprogramming its RAM-blocks we can implement a different functionality of the FSM. The proposed method permits the translati...

متن کامل

Easily Testable PLA-based FSMS

-A new hardware scheme for easily testable PLA-based Finite State Machines is proposed. With our scheme, all combinationally irredundant crosspoint faults in the PLA logic implementation are testable. Moreover, test generation is easily accomplished because short systematic initialization sequences exist for each internal state in the machine and unit length distinguishing sequences, which hold...

متن کامل

reducing hardware complexity of wallace multiplier using high order compressors based on cntfet

multiplier is one of the important components in many systems such as digital filters, digital processors and data encryption. improving the speed and area of multipliers have impact on the performance of larger arithmetic circuits that are part of them. wallace algorithm is one of the most famous architectures that uses a tree of half adders and full adders to increase the speed and reduce the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronics

سال: 2022

ISSN: ['2079-9292']

DOI: https://doi.org/10.3390/electronics11203389